A ug 2 00 4 Proofs Without Syntax
نویسنده
چکیده
" Mathematicians care no more for logic than logicians for mathematics. " Augustus de Morgan, 1868 Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional calculus (propositional logic) in which proofs are combinatorial (graph-theoretic), rather than syntactic. It defines a combinatorial proof of a proposition φ as a graph homomorphism h : G → G(φ), where G(φ) is a graph associated with φ , and G is a coloured graph. The main theorem is soundness and completeness: φ is true iff there exists a combinatorial proof h : G → G(φ).
منابع مشابه
ar X iv : m at h / 05 08 63 6 v 1 [ m at h . SG ] 3 1 A ug 2 00 5 Cotangent bundle reduction
This encyclopedia article briefly reviews without proofs some of the main results in cotangent bundle reduction. The article recalls most the necessary prerequisites to understand the main
متن کاملar X iv : m at h / 05 04 06 5 v 1 [ m at h . L O ] 4 A pr 2 00 5 Logic Without Syntax
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract , syntax-free contraction-weakening proofs; (3) distribution ; (4) axioms p ∨ p. Abstract propositions correspond to objects of the category G(Rel L) where G is the Hyland-Tan double glue-ing construction, Rel is the standar...
متن کاملar X iv : m at h . H O / 0 30 52 13 v 2 1 1 A ug 2 00 4 Passages of Proof
In this paper we propose a new perspective on the evolution and history of the idea of mathematical proof. Proofs will be studied at three levels: syntactical, semantical and pragmatical. Computer-assisted proofs will be give a special attention. Finally, in a highly speculative part, we will anticipate the evolution of proofs under the assumption that the quantum computer will materialize. We ...
متن کاملar X iv : m at h . L O / 0 50 40 65 v 1 4 A pr 2 00 5 Logic Without
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract , syntax-free contraction-weakening proofs; (3) distribution ; (4) axioms p ∨ p. Abstract propositions correspond to objects of the category G(Rel L) where G is the Hyland-Tan double glue-ing construction, Rel is the standar...
متن کاملA ug 2 00 9 Technical appendix to “ Adaptive estimation of stationary Gaussian fields ”
This is a technical appendix to “Adaptive estimation of stationary Gaussian fields” [6]. We present several proofs that have been skipped in the main paper. These proofs are organised as in Section 8 of [6]. AMS 2000 subject classifications: Primary 62H11; secondary 62M40.
متن کامل